Nondeterministic Instance Complexity and Proof Systems with Advice
نویسندگان
چکیده
Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj́ıček [1] have recently introduced the notion of propositional proof systems with advice. In this paper we investigate the following question: Given a language L, do there exist polynomially bounded proof systems with advice for L? Depending on the complexity of the underlying language L and the amount and type of the advice used by the proof system, we obtain different characterizations for this problem. In particular, we show that the above question is tightly linked with the question whether L has small nondeterministic instance complexity.
منابع مشابه
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies
In this note we rst formalize the notion of hard tautologies using a nondeterministic generalization of instance complexity. We then show, under reasonable complexity-theoretic assumptions, that there are innnitely many propositional tautologies that are hard to prove in any sound propositional proof system.
متن کاملOn Slicewise Monotone Parameterized Problems and Optimal Proof Systems for TAUT
For a reasonable sound and complete proof calculus for first-order logic consider the problem to decide, given a sentence φ of first-order logic and a natural number n, whether φ has no proof of length ≤ n. We show that there is a nondeterministic algorithm accepting this problem which, for fixed φ, has running time bounded by a polynomial in n if and only if there is an optimal proof system fo...
متن کاملFrom focussed proof systems to complexity bounds
We conduct a complexity-theoretic study of focussed proof systems, relating the alternation of synchronous and asynchronous phases in a proof to an appropriate alternating time hierarchy, for instance the polynomial hierarchy. We propose a notion of ‘over-focussing’ that admits non-branching invertible rules during synchronous phases, due to the fact that deterministic computations can equally ...
متن کاملDoes Advice Help to Prove Propositional Tautologies?
One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable functions which have all propositional tautologies as their range. Motivated by provability consequences in bounded arithmetic, Cook and Kraj́ıček [5] have recently started the investigation of proof systems which are co...
متن کاملLinear-Nondeterminism Linear Advice for the P-Selective Sets
Hemaspaandra and Torenvliet showed that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and quasilinear nondeterminism. We extend this by showing that each P-selective set can be accepted by a polynomial-time nondeterministic machine using linear advice and linear nondeterminism.
متن کامل